A Coherence Theorem for Martin-Löf's Type Theory
نویسنده
چکیده
In type theory a proposition is represented by a type, the type of its proofs. As a consequence, the equality relation on a certain type is represented by a binary family of types. Equality on a type may be conventional or inductive. Conventional equality means that one particular equivalence relation is singled out as the equality, while inductive equality – which we also call identity – is inductively defined as the ‘smallest reflexive relation’. It is sometimes convenient to know that the type representing a proposition is collapsed, in the sense that all its inhabitants are identical. Although uniqueness of identity proofs for an arbitrary type is not derivable inside type theory, there is a large class of types for which it may be proved. Our main result is a proof that any type with decidable identity has unique identity proofs. This result is convenient for proving that the class of types with decidable identities is closed under indexed sum. Our proof of the main result is completely formalized within a kernel fragment of Martin-Löf’s type theory and mechanized using ALF. Proofs of auxiliary lemmas are explained in terms of the category theoretical properties of identity. These suggest two coherence theorems as the result of rephrasing the main result in a context of conventional equality, where the inductive equality has been replaced by, in the former, an initial category structure and, in the latter, a smallest reflexive relation.
منابع مشابه
Kripke Semantics for Martin-Löf's Extensional Type Theory
It is well-known that simple type theory is complete with respect to nonstandard set-valued models. Completeness for standard models only holds with respect to certain extended classes of models, e.g., the class of cartesian closed categories. Similarly, dependent type theory is complete for locally cartesian closed categories. However, it is usually difficult to establish the coherence of inte...
متن کاملSet theoretical proofs as type theoretical programs
We show, that all Π 0 2-sentences, provable in the set theory KP I + U can be proved in Martin-Löf's Type Theory with W-type and one universe. Therefore set theoretical proofs can be considered as programs in type theory. The method used is a formalisation of proof theoretical methods in type theory. The result will be a high level type theory program using the full strength of Martin-Löf's Typ...
متن کاملA cartesian closed category in Martin-Löf's intuitionistic type theory
First, we briefly recall the main definitions of the theory of Information Bases and Translations. These mathematical structures are the basis to construct the cartesian closed category InfBas, which is equivalent to the category ScDom of Scott Domains. Then, we will show that all the definitions and the proof of all the properties that one needs in order to show that InfBas is indeed a cartesi...
متن کاملA machine assisted formalization of pointfree topology in type theory
We will present a formalization of pointfree topology in Martin-Löf's type theory. A notion of point will be introduced and we will show that the points of a Scott topology form a Scott domain. This work follows closely the intuitionistic approach to pointfree topology and domain theory, developed mainly by Martin-Löf and Sambin. The important di erence is that the de nitions and proofs are mac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Funct. Program.
دوره 8 شماره
صفحات -
تاریخ انتشار 1998